Browsing by Subject "Graph theory"

Now showing items 1-20 of 78

    • Conference Object  

      Addressing network survivability issues by finding the K-best paths through a trellis graph 

      Nikolopoulos, Stavros D.; Pitsillides, Andreas; Tipper, David (IEEE, 1997)
      Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (such as voice, data, and video) across high speed communication networks, it is becoming important for ...
    • Conference Object  

      Bond graph based modal decomposition of systems with non-proportional damping 

      Louca, Loucas S. (Affiliation: Department of Mechanical and Manufacturing Engineering, University of Cyprus, 75 Kallipoleos Street, Nicosia 1678, CyprusCorrespondence Address: Louca, L.S.Department of Mechanical and Manufacturing Engineering, University of Cyprus, 75 Kallipoleos Street, Nicosia 1678, Cyprusemail: lslouca@ucy.ac.cy, 2012)
      Modal analysis of lumped parameter and continuous dynamic linear systems is extensively used to study their dynamic behavior and controller design. In both cases, a reduction of the model size that does not degrade accuracy ...
    • Conference Object  

      Bond graph based modal representations and model reduction of lumped parameter systems 

      Louca, Loucas S. (Affiliation: Department of Mechanical and Manufacturing Engineering, University of Cyprus, 75 Kallipoleos Street, Nicosia 1678, CyprusCorrespondence Address: Louca, L.S.Department of Mechanical and Manufacturing Engineering, University of Cyprus, 75 Kallipoleos Street, Nicosia 1678, Cyprusemail: lslouca@ucy.ac.cy, 2006)
      Modal analysis is extensively used to study dynamic behavior of continuous and lumped parameter linear systems. More specifically, modal analysis can be used for the analysis and controller design of dynamic systems. In ...
    • Article  

      Bounds on the number of markings consistent with label observations in petri nets 

      Ru, Y.; Hadjicostis, Christoforos N. (2009)
      In this paper, we consider state estimation in discrete-event systems (DESs) modeled by labeled Petri nets and present upper bounds on the number of system states (or markings) that are consistent with an observed sequence ...
    • Conference Object  

      Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2002)
      The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous ...
    • Article  

      CDNs content outsourcing via generalized communities 

      Katsaros, Dimitrios S.; Pallis, George C.; Stamos, Kostas; Vakali, Athena I.; Sidiropoulos, Antonis; Manolopoulos, Yannis (2009)
      Content distribution networks (CDNs) balance costs and quality in services related to content delivery. Devising an efficient content outsourcing policy is crucial since, based on such policies, CDN providers can provide ...
    • Article  

      A clustering-based prefetching scheme on a Web cache environment 

      Pallis, George C.; Vakali, Athena I.; Pokorný, Jaroslav (2008)
      Web prefetching is an attractive solution to reduce the network resources consumed by Web services as well as the access latencies perceived by Web users. Unlike Web caching, which exploits the temporal locality, Web ...
    • Conference Object  

      Comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors 

      Dikaiakos, Marios D.; Steiglitz, Kenneth; Rogers, Anne (IEEE, 1994)
      This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of ...
    • Article  

      Complex-valued tapers 

      Politis, Dimitris Nicolas (2005)
      The spectral estimation method based on the average of short, tapered periodograms is re-examined. The bias of such estimators is typically O(1/b2), where b is the length of the short blocks. Much of the current researeh ...
    • Conference Object  

      Complexity of distributed parameter bond graph models 

      Louca, Loucas S. (The Society for Modeling and Simulation International, 2014)
      Modeling metrics and algorithms that assist the development of dynamic system models are essential for efficient use of modeling and simulation in everyday engineering tasks. Various modeling procedures have been proposed ...
    • Article  

      The computational value of joint consistency 

      Dimopoulos, Yannis (1994)
      In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied ...
    • Article  

      Decreased centrality of cortical volume covariance networks in autism spectrum disorders 

      Balardin, J. B.; Comfort, W. E.; Daly, Eileen M.; Murphy, Clodagh M.; Andrews, Derek Sayre; Murphy, Declan G. M.; Ecker, C.; Sato, J. R.; Bailey, Anthony J.; Baron-Cohen, Simon; Bolton, P. F.; Bullmore, Edward T.; Carrington, S.; Catani, Marco; Chakrabarti, B.; Craig, Michael C.; Daly, Eileen M.; Deoni, Sean C. L.; Happé, Francesca; Henty, Julian; Jezzard, Peter; Johnston, Patrick; Jones, D. K.; Lai, Meng-Chuan; Lombardo, Michael V.; Madden, A.; Mullins, D.; Murphy, Clodagh M.; Murphy, Declan G. M.; Pasco, Greg; Ruigrok, Amber N. V.; Sadek, Susan A.; Spain, D.; Stewart, R.; Suckling, John; Wheelwright, Sally J.; Williams, Steven C. R.; Wilson, C. E.; MRC AIMS Consortium (2015)
      Autism spectrum disorders (ASD) are a group of neurodevelopmental conditions characterized by atypical structural and functional brain connectivity. Complex network analysis has been mainly used to describe altered ...
    • Article  

      Designs of bisimilar Petri net controllers with fault tolerance capabilities 

      Li, L.; Hadjicostis, Christoforos N.; Sreenivas, R. S. (2008)
      This paper proposes an approach for providing tolerance against faults that may compromise the functionality of a given controller modeled by a Petri net. The method is based on embedding the given Petri net controller ...
    • Article  

      Distributed Balancing of Commodity Networks Under Flow Interval Constraints 

      Hadjicostis, Christoforos N.; Domínguez-Garcia, A. D. (2018)
      We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...
    • Article  

      Distributed cycle detection and removal 

      Oliva, G.; Setola, R.; Glielmo, L.; Hadjicostis, Christoforos N. (2018)
      In this paper, we provide distributed algorithms to detect and remove cycles in a directed relational graph by exploiting the underlying undirected communication graph; the relational graph models a relation among the ...
    • Article  

      Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays 

      Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, Christoforos N.; Johansson, M. (2015)
      Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number ...
    • Article  

      Distributed finite-time calculation of node eccentricities, graph radius and graph diameter 

      Oliva, G.; Setola, R.; Hadjicostis, Christoforos N. (2016)
      The distributed calculation of node eccentricities, graph radius and graph diameter are fundamental steps to tune network protocols (e.g., setting an adequate time-to-live of packets), to select cluster heads, or to execute ...
    • Article  

      Distributed resource coordination in networked systems described by digraphs 

      Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2015)
      We consider a multicomponent system in which each component can receive/transmit information from/to components in its immediate neighborhood. Communication links between components are not required to be bidirectional, ...
    • Doctoral Thesis  Open Access

      Distributed weight balancing in directed topologies 

      Rikos, Apostolos I. (Πανεπιστήμιο Κύπρου, Πολυτεχνική Σχολή / University of Cyprus, Faculty of Engineering, 2018-05)
      Ένα κατανεμημένο σύστημα ή δίκτυο μπορεί να θεωρηθεί ως ένα σύνολο υποσυστημάτων που μπορούν να μοιράζονται πληροφορίες μέσω διασυνδέσεων, οι οποίες αποτελούν μια κατευθυνόμενη τοπολογία επικοινωνίας. Τα κατανεμημένα ...
    • Article  

      Distributed weight balancing over digraphs 

      Rikos, A. I.; Charalambous, T.; Hadjicostis, Christoforos N. (2014)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...